SilentKnock: practical, provably undetectable authentication
نویسندگان
چکیده
منابع مشابه
Practical & Provably Secure Distance-Bounding
Distance-bounding is a practical solution to be used in security-sensitive contexts, to prevent relay attacks. Its applied cryptographic role is definitely spreading fast and it is clearly far reaching, extending from contactless payments to remote car unlocking. However, security models for distance-bounding are not well-established and, as far as we know, no existing protocol is proven to res...
متن کاملProvably Secured Two Server Hash Password Authentication
The techniques of secured socket layer (SSL) with client-side certificates for commercial web sites rely on a relatively weak form of password authentication. Browser sends a user’s plaintext password to a remote web server using SSL is vulnerable to attack. In common password attacks, hackers exploit the fact that web users often use the same password at many different sites. This has drawn at...
متن کاملPractical and Provably Secure Distance-Bounding
From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recently emerged as the first family of lightweight and provably secure distance bounding protocols. More precisely, we explicate a general formalis...
متن کاملPractical Covert Authentication
Von Ahn, Hopper, and Langford [vAHL05] introduced the notion of two-party steganographic a.k.a. covert computation, which assures that neither party can distinguish its counterparty from a random noise generator, except for what is revealed by the final output of the securely computed function. The flagship motivation for covert computation is covert authentication, where two parties want to au...
متن کاملPractical Message Authentication Schemes
Use of encryption algorithms in message authentication is replaced by secure hash functions which are often faster than encryption algorithms. Tsudik 14] has proposed three methods on message authentication which are only based on one-way hash functions and use some keys to make them secure. In this paper, we give a set of practical methods, each of which uses a fast collision free hash functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Security
سال: 2008
ISSN: 1615-5262,1615-5270
DOI: 10.1007/s10207-008-0070-1